An absolute-value linear programming problem

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Absolute Value Equation Solution Via Linear Programming

By utilizing a dual complementarity property, we propose a new linear programming method for solving the NP-hard absolute value equation (AVE): Ax−|x| = b, where A is an n×n square matrix. The algorithm makes no assumptions on the AVE other than solvability and consists of solving a few linear programs, typically less than four. The algorithm was tested on 500 consecutively generated random sol...

متن کامل

Absolute value programming

We investigate equations, inequalities and mathematical programs involving absolute values of variables such as the equation Ax + B|x| = b, where A and B are arbitrary m × n real matrices. We show that this absolute value equation is NP-hard to solve, and that solving it solves the general linear complementarity problem. However, we propose a concave minimization problem for its solution that i...

متن کامل

Mixed Integer Linear Programming Method for Absolute Value Equations

We formulate the NP-hard absolute value equation as linear complementary problem when the singular values of A exceed one, and we proposed a mixed integer linear programming method to absolute value equation problem. The effectiveness of the method is demonstrated by its ability to solve random problems.

متن کامل

Linear Programming for the Location Problem with Minimum Absolute Error

Abstract: Let n points be given in the plane. For each point a weight and a radius is given. The radius of each point is our expected ideal distance from the point to a new facility. In this paper we consider the location problem with minimum absolute errors. In this problem we want to find the location of the new facility such that the sum of weighted absolute errors between points and this ne...

متن کامل

Linear Absolute Value Relation Analysis

Linear relation analysis (polyhedral analysis), devoted to discovering linear invariant relations among variables of a program, remains one of the most powerful abstract interpretations but is subject to convexity limitations. Absolute value enjoys piecewise linear expressiveness and thus natively fits to encode certain non-convex properties. Based on this insight, we propose to use linear abso...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Mathematical Analysis and Applications

سال: 1969

ISSN: 0022-247X

DOI: 10.1016/0022-247x(69)90118-8